21: ; (* Back-substitution *) 122: for I Count (n -1) -0 + 1 from N
ثبت نشده
چکیده
منابع مشابه
Positive solutions for a nonlinear nonlocal elliptic transmission problem
K e y w o r d s E l l i p t i c system, Transmission problem, Positive solution. 1. I N T R O D U C T I O N Let 12 be a smooth bounded domain of R n, n > 2, and let ~1 c gl be a subdomain with smooth boundary ~ satisfying ~1 C i2. Writing F = c9~ and gl2 = ~\~l l we have ~ = ~1 tJ 122 and 0i'~2 = ~, tJ F. We are concerned with the existence of positive solutions to the following system of nonli...
متن کاملCount( qq) versus the pigeon-hole principle
For each p ≤ 2 there exist a model M∗ of I∆0(α) which satisfies the Count(p) principle. Furthermore if p contain all prime factors of q there exist n, r ∈ M∗ and a bijective map f ∈ Set(M∗) mapping {1, 2, ..., n} onto {1, 2, ..., n+ qr}. A corollary is a complete classification of the Count(q) versus Count(p) problem. Another corollary solves an open question ([3]). In this note I state and pro...
متن کاملGeneralizing Narayana and Schröder Numbers to Higher Dimensions
Let C(d, n) denote the set of d-dimensional lattice paths using the steps X1 := (1, 0, . . . , 0), X2 := (0, 1, . . . , 0), . . . , Xd := (0, 0, . . . , 1), running from (0, 0, . . . , 0) to (n, n, . . . , n), and lying in {(x1, x2, . . . , xd) : 0 ≤ x1 ≤ x2 ≤ . . . ≤ xd}. On any path P := p1p2 . . . pdn ∈ C(d, n), define the statistics asc(P ) :=|{i : pipi+1 = XjX`, j < `}| and des(P ) :=|{i :...
متن کاملSmoothing methods in maximum entropy language modeling
This paper discusses various aspects of smoothing techniques in maximum entropy language modeling, a topic not sufficiently covered by previous publications. We show (1) that straightforward maximum entropy models with nested features, e.g. tri–, bi–, and unigrams, result in unsmoothed relative frequencies models; (2) that maximum entropy models with nested features and discounted feature count...
متن کاملSome Asymptotic Properties of Generalized Fibonacci Numbers
1. INTRODUCTION Horadam [1] has generalized two theorems of Subba Rao [3] which deal with some asymptotic p r o p e r t i e s of Fibonacci numbers. Horadam defined a sequence {w (n 2) where a , a are the roots of x 2-P 21 x + P 2 2 = 0. We shall let 06 """ LX r\ r\ UO r\-| • Horadam established two theorems for {w n }: I. The number of terms of {w n } not exceeding N is asymptotic to log(Nd/(P ...
متن کامل